On the numerical solution of the discrete-time algebraic Riccati equation
نویسندگان
چکیده
منابع مشابه
The Descriptor Discrete–time Riccati Equation: Numerical Solution and Applications∗
We investigate the numerical solution of a descriptor type discrete–time Riccati equation and give its main applications in several key problems in robust control formulated under very general hypotheses: rank compression (squaring down) of improper or polynomial systems with L∞–norm preservation, (J, J ′)–spectral and (J, J ′)–lossless factorizations of a completely general discrete–time syste...
متن کاملOn the Discrete-Time Algebraic Riccati Equation and Its Solution in Closed-Form
Abstract: In the present paper we obtain a closed-form solution for the class of discrete-time algebraic Riccati equations (DTARE), whenever the eigenvalues of the A matrix are distinct. The obtained closed-form solution gives insight on issues such as loss of controllability and it might also prove comparable in terms of numerical precision over current solving algorithms. We also consider fur...
متن کاملIntervals of solutions of the discrete-time algebraic Riccati equation
If two solutions Y ≤ Z of the DARE are given then the set of solutions X with Y ≤ X ≤ Z can be parametrized by invariant subspaces of the closed loop matrix corresponding to Y . The paper extends the geometric theory of Willems from the continuous-time to the discrete-time ARE making the weakest possible assumptions.
متن کاملPerturbation Analysis of the Periodic Discrete-Time Algebraic Riccati Equation
This paper is devoted to the perturbation analysis for the periodic discrete-time algebraic Riccati equations (P-DAREs). Perturbation bounds and condition numbers of the Hermitian positive semidefinite solution set to the P-DAREs are obtained. The results are illustrated by numerical examples.
متن کاملAn efficient algorithm for the discrete-time algebraic Riccati equation
In this paper the authors develop a new algorithm to solve the standard discrete-time algebraic Riccati equation by using a skewHamiltonian transformation and the square-root method. The algorithm is structure-preserving and efficient because the Hamiltonian structure is fully exploited and only orthogonal transformations are used. The efficiency and stability of the algorithm are analyzed. Num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 1980
ISSN: 0018-9286
DOI: 10.1109/tac.1980.1102434